Approximately rings in proximal relator spaces
نویسندگان
چکیده
منابع مشابه
Upper and Lower Bounds in Relator Spaces
An ordered pair X (R) = (X, R ) consisting of a nonvoid set X and a nonvoid family R of binary relations on X is called a relator space. Relator spaces are straightforward generalizations not only of uniform spaces, but also of ordered sets. Therefore, in a relator space we can naturally define not only some topological notions, but also some order theoretic ones. It turns out that these two, a...
متن کاملProximal and Semi-proximal Spaces
Proximal and semi-proximal spaces are defined with the help of a game played on uniform spaces. Proximal spaces are where the entourage-picker has a winning strategy, and semi-proximal spaces are where the opponent, the point-picker, does not have a winning strategy. The class of proximal spaces is closed under Σ-products and closed subspaces. In this paper it is shown that product of two semi-...
متن کاملProximal Analysis in Smooth Spaces
Thanks are due to Qiji Zhu and Halina Strojwas for many useful conversations on this material. Abstract. We provide a highly{reened sequential description of the generalized gradients of Clarke and approximate G{subdiierential of a lower semicontinuous extended{real{valued function deened on a Banach space with a {smooth equivalent renorm. In the case of a Frech et diierentiable renorm we give ...
متن کاملOn the Size of Approximately Convex Sets in Normed Spaces
Let X be a normed space. A set A ⊆ X is approximately convex if d(ta + (1 − t)b, A) ≤ 1 for all a, b ∈ A and t ∈ [0, 1]. We prove that every n-dimensional normed space contains approximately convex sets A with H(A,Co(A)) ≥ log2 n− 1 and diam(A) ≤ C √ n(lnn), where H denotes the Hausdorff distance. These estimates are reasonably sharp. For every D > 0, we construct worst possible approximately c...
متن کاملOn One-relator Inverse Monoids and One-relator Groups
It is known that the word problem for one-relator groups and for one-relator monoids of the form Mon〈A ‖ w = 1〉 is decidable. However, the question of decidability of the word problem for general one-relation monoids of the form M = Mon〈A ‖ u = v〉 where u and v are arbitrary (positive) words in A remains open. The present paper is concerned with one-relator inverse monoids with a presentation o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS
سال: 2019
ISSN: 1303-6149
DOI: 10.3906/mat-1907-3